Scheduling Interviews for a Job Fair

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scheduling Interviews for a Job Fair

We describe the design and use of a program to schedule job interviews for law firms and students at a job fair. It has been used to manage the Southeastern Public Interest Job Fair for the last five years. The program uses a new scheduling algorithm that produces particularly convenient

متن کامل

Scheduling Job Placement Interviews at a University

We describe experience with a job interview scheduling system that has been in use since 2001 at the University of Chicago Graduate School of Business(UCGSB). During interview season, a typical week has 300 job-seekers requesting 1000 interviews from 100 interviewing companies, to be scheduled into 1200 timeslots. We match job-seekers with companies with time slots so that we maximize the numbe...

متن کامل

Preemptive ReduceTask Scheduling for Fair and Fast Job Completion

Hadoop MapReduce adopts a two-phase (map and reduce) scheme to schedule tasks among data-intensive applications. However, under this scheme, Hadoop schedulers do not work effectively for both phases. We reveal that there exists a serious fairness issue among jobs of different sizes, leading to prolonged execution for small jobs, which are starving for reduce slots held by large jobs. To solve t...

متن کامل

A Fair Scheduling for Wireless Mesh Networks

Wireless Mesh Networks (WMNs) represent a new and promising paradigm that uses multi-hop communications to extend WiFi networks: By deploying only one hot spot (directly connected to the Internet) and several transient access points (TAPs), an Internet Service Provider (ISP) can extend its coverage and serve a large number of clients using a single broadband connection. Unfortunately, if the me...

متن کامل

Fair Scheduling for Multiple Submissions

Today, most available parallel environments support multiple users executing their jobs in a common shared infrastructure. In such environments, when scheduling individually important jobs from different users, the problem of fairness arises. In this work, we propose a fair scheduling algorithm that handles this problem by adopting processor fair-share as a strategy for user fairness. The user’...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Operations Research

سال: 1990

ISSN: 0030-364X,1526-5463

DOI: 10.1287/opre.38.6.951